Non-contextual chocolate ball versus value indefinite quantum cryptography
نویسنده
چکیده
Some quantum cryptographic protocols can be implemented with specially prepared metaphorical chocolate balls representing local hidden variables, others protected by value indefiniteness cannot. This latter feature, which follows from Belland Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes. Conversely, there exist local hidden variable models based on chocolate ball configurations utilizable for cryptography which cannot be realized by quantum systems. The possibility that quantum cryptography supported by value indefiniteness (contextuality) has practical advantages over more conventional quantum cryptographic protocols remains highly speculative.
منابع مشابه
Staging quantum cryptography with chocolate balls
Quantum cryptography is a relatively recent and very active field of research. Its main characteristic is the use of individual particles for encrypted information transmission. Its objective is to encrypt messages or to create and enlarge a set of secret equal random numbers between two spatially separated agents by means of elementary particles, such as single photons, that are transmitted th...
متن کاملCDMTCS Research Report Series Bertlmann’s chocolate balls and quantum type cryptography
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This featur...
متن کاملCryptography with quanta and chocolate balls
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This featur...
متن کاملBertlmann’s chocolate balls and quantum type cryptography
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This featur...
متن کامل